Reversals and Transpositions over Finite Alphabets

Extending results of Christie and Irving, we examine the action of reversals and transpositions on finite strings over an alphabet of size k. We show that determining reversal, transposition or signed reversal distance between two strings over a finite alphabet is NP-hard, while for ‘dense’ instances we give a polynomial-time approximation scheme. We also give a number of extremal results, as well as investigating the distance between random strings and the problem of sorting a string over a finite alphabet.